Preemptive scheduling of EV charging for providing demand response services

We develop a new algorithm for scheduling the charging process of large number electric vehicles (EVs) over finite horizon. assume that EVs arrive at stations with different charge levels and flexibility windows. The arrival is assumed to have known distribution can be preemptive. pose problem as dynamic program constraints. show resulting formulation leads monotone Lipschitz continuous value functions are robust against perturbation system parameters. propose simulation based fitted iteration determine function approximately, derive sample complexity computing approximately optimal solution.